Pairwise Independent Random Variables

In this lecture we discuss how to derandomize algorithms. We will see a brute force algorithm (enumeration) for derandomization. We will also see that some random algorithms do not need true randomness. Specifically, we will see an example where only pairwise random bits are needed. Next, we will see how we can generate pairwise random values and how this conservation on the amount of randomness can reduce the time needed for derandomization. In the end we discuss a two-point sampling algorithm that also reduces the number of random bits needed but it worsens the running time.